A MCMC Approach to Hierarchical Mixture Modelling
نویسنده
چکیده
There are many hierarchical clustering algorithms available, but these lack a firm statistical basis. Here we set up a hierarchical probabilistic mixture model, where data is generated in a hierarchical tree-structured manner. Markov chain Monte Carlo (MCMC) methods are demonstrated which can be used to sample from the posterior distribution over trees containing variable numbers of hidden units.
منابع مشابه
Reparameterisation Issues in Mixture Modelling and Their Bearing on Mcmc Algorithms
There is increasing need for eecient estimation of mixture distributions, especially following the explosion in the use of these as modelling tools in many applied elds. We propose in this paper a Bayesian noninformative approach for the estimation of normal mixtures which relies on a reparameterisation of the secondary components of the mixture in terms of divergence from the main component. A...
متن کاملModel-based clustering based on sparse finite Gaussian mixtures
In the framework of Bayesian model-based clustering based on a finite mixture of Gaussian distributions, we present a joint approach to estimate the number of mixture components and identify cluster-relevant variables simultaneously as well as to obtain an identified model. Our approach consists in specifying sparse hierarchical priors on the mixture weights and component means. In a deliberate...
متن کاملProbabilistic inference of bifurcations in single-cell data using a hierarchical mixture of factor analysers
Modelling bifurcations in single-cell transcriptomics data has become an increasingly popular field of research. Several methods have been proposed to infer bifurcation structure from such data but all rely on heuristic non-probabilistic inference. Here we propose the first generative, fully probabilistic model for such inference based on a Bayesian hierarchical mixture of factor analysers. Our...
متن کاملA Comparison of Two MCMC Algorithms for Hierarchical Mixture Models
Mixture models form an important class of models for unsupervised learning, allowing data points to be assigned labels based on their values. However, standard mixture models procedures do not deal well with rare components. For example, pause times in student essays have di↵erent lengths depending on what cognitive processes a student engages in during the pause. However, instances of student ...
متن کاملTree-Guided MCMC Inference for Normalized Random Measure Mixture Models
Normalized random measures (NRMs) provide a broad class of discrete random measures that are often used as priors for Bayesian nonparametric models. Dirichlet process is a well-known example of NRMs. Most of posterior inference methods for NRM mixture models rely on MCMC methods since they are easy to implement and their convergence is well studied. However, MCMC often suffers from slow converg...
متن کامل